Classification of binary self-dual [48, 24, 10] codes with an automorphism of odd prime order
نویسندگان
چکیده
The purpose of this paper is to complete the classification of binary self-dual [48, 24, 10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48, 24, 10] code with an automorphism of type p-(c, f) with p being an odd prime, then p = 3, c = 16, f = 0. By considering only an automorphism of type 3-(16, 0), we prove that there are exactly 264 inequivalent self-dual [48, 24, 10] codes with an automorphism of odd prime order, equivalently, there are exactly 264 inequivalent cubic self-dual [48, 24, 10] codes.
منابع مشابه
New results on the classification of binary self - dual [ 52 , 26 , 10 ] codes with an automorphism of odd prime order 1
The paper presents an important step toward the complete classification of all optimal binary self-dual codes of length 52 that possess an automorphism of odd prime order. Using a method for constructing and classifying binary self-dual codes with an automorphism of odd prime order p we give full classification of all [52, 26, 10] binary self-dual codes with an authomorphism of type 3-(16,4) an...
متن کاملFurther results on the classification of binary self - dual [ 52 , 26 , 10 ] codes with an automorphism of odd prime order 1
The paper presents the next step on the complete classification of all optimal binary selfdual codes of length 52 that possess an automorphism of odd prime order. Applying the method for constructing binary self-dual codes with an automorphism of odd prime order p=3 we give full classification of all [52, 26, 10] binary self-dual codes with an automorphism of type 3-(16,4) for the next unsolved...
متن کاملOn the classication of binary self-dual [44, 22, 8] codes with an automorphism of order 3 or 7
All binary self-dual [44, 22, 8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.
متن کاملOn the automorphism groups of binary linear codes
Let C be a binary linear code and suppose that its automorphism group contains a non trivial subgroup G. What can we say about C knowing G? In this paper we collect some answers to this question in the cases G ∼= Cp, G ∼= C2p and G ∼= D2p (p an odd prime), with a particular regard to the case in which C is self-dual. Furthermore we generalize some methods used in other papers on this subject. F...
متن کاملOn involutions in extremal self-dual codes and the dual distance of semi self-dual codes
A classical result of Conway and Pless is that a natural projection of the xed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual [13]. In this paper we prove that the same holds for involutions under some (quite strong) conditions on the codes. In order to prove it, we introduce a new family of binary codes: the semi self-dual codes. A binary self-orthogo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 18 شماره
صفحات -
تاریخ انتشار 2012